#include <common.h>
class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int dp[prices.size()][2];
        dp[0][0]=0;
        dp[0][1]=-prices[0];
        for (int i = 1; i < prices.size(); i++) {
            dp[i][0]=max(dp[i-1][0], dp[i-1][1]+prices[i]);
            dp[i][1]=max(dp[i-1][1], dp[i-1][0]-prices[i]);
        }
        return dp[prices.size()-1][0];
    }
};

int main() {
    auto sp=new Solution();
    vector<int> nums{7,1,5,3,6,4};
    int max_profit = sp->maxProfit(nums);
    cout<<max_profit<<endl;
    return 0;
}